Natural Deduction for Sublogics of Predicate Logic

نویسنده

  • Mario Benevides
چکیده

This work gives a natural deduction presentations to some of the sublogic of predicate logic vB94] and also to some of Alechina and J. van Benthem's sublogics. These presentations are based on BM92, Ben95, Gab94] and Gabbay's Labelled Deductive System LDS Gab94]. It also proves some correspondence results for the sublogics presented in vB94] and some completeness theorem to the classes of models presented in Ale95].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicate logic with flexibly binding operators and natural language semantics

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including ‘donkey sentences’ and crosssentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predi...

متن کامل

First-order logic - Wikipedia, the free encyclopedia

First-order logic (FOL) is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus, the language of first-order logic or predicate logic. Unlike natural languages such as English, FOL uses a wholly unambiguous formal language interpreted by mathematical str...

متن کامل

A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation

Bellin, G. and J. Ketonen, A decision procedure revisited: Notes on direct logic, linear logic and its implementation, Theoretical Computer Science 95 (1992) 115-142. This paper studies decidable fragments of predicate calculus. We will focus on the structure of direct predicate calculus as defined in Ketonen and Weyhrauch (1984) in the light of the recent work of Girard (Girard 1987, 1988) on ...

متن کامل

W-JS: A Modal Logic of Knowledge

W-JS is a first-order predicate calculus on the modal theory of knowledge. It is based on natural deduction rules and accompanied by possible-world-accessibility semantics. As an example, the famous "Mr. S and Mr. P" puzzle is solved in W-JS.

متن کامل

Intuitionistic Existential Instantiation and Epsilon Symbol

A natural deduction system for intuitionistic predicate logic with existential instantiation rule presented here uses Hilbert’s ǫ-symbol. It is conservative over intuitionistic predicate logic. We provide a completeness proof for a suitable Kripke semantics, sketch an approach to a normalization proof, survey related work and state some open problems. Our system extends intuitionistic systems w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997